new mathematical modeling for a facilities location and vehicle routing problem solving by a hybrid imperialist competitive algorithm

Authors

نرگس نوروزی

دانشجوی دکتری مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران رضا توکلی مقدم

استاد دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران محسن صادق عمل نیک

دانشیار دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران صادق خائفی

دانشجوی کارشناسی ارشد دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران

abstract

increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may not be the optimum solution of the original problem. hence, in this paper, facilities location and vehicle routing problems are considered simultaniously to visit the facilities that should be serviced. due to the complexity of the integrated problem in large sizes, a hybrid imperialist competitive algorithm (ica) is proposed. furthermore, to show the efficiency of the proposed hybrid ica, a number of test problems in small and large sizes are solved. finally, the obtained results are evaluated with the results obtained by cplex. finally, the conclusion is provided.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

An Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem

The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...

full text

Solving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm

A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...

full text

A New Multi-Objective Inventory-Routing Problem by an Imperialist Competitive Algorithm

One of the most important points in a supply chain is customer-driven modeling, which reduces the bullwhip effect in the supply chain, as well as the costs of investment on the inventory and efficient transshipment of the products. Their homogeneity is reflected in the inventory-routing problem, which is a combination of distribution and inventory management. This paper considers a multi object...

full text

A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

full text

Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...

full text

A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem

In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...

full text

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023